-
1 combinatoire
См. также в других словарях:
Combinatorial principles — In proving results in combinatorics several useful combinatorial rules or combinatorial principles are commonly recognized and used. The rule of sum, rule of product, and inclusion exclusion principle are often used for enumerative purposes.… … Wikipedia
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
Linguistic competence — Linguistics … Wikipedia
Force field (chemistry) — In the context of molecular mechanics, a force field (also called a forcefield) refers to the functional form and parameter sets used to describe the potential energy of a system of particles (typically but not necessarily atoms). Force field… … Wikipedia
E. E. Cummings — in 1953 Born Edward Estlin Cummings October 14, 1894(1894 10 14) Cambridge, Massachusetts … Wikipedia
Game complexity — Combinatorial game theory has several ways of measuring game complexity. This article describes five of them: state space complexity, game tree size, decision complexity, game tree complexity, and computational complexity. Contents 1 Measures of… … Wikipedia
Combinatory logic — Not to be confused with combinational logic, a topic in digital electronics. Combinatory logic is a notation introduced by Moses Schönfinkel and Haskell Curry to eliminate the need for variables in mathematical logic. It has more recently been… … Wikipedia
Computer Go — Part of a series of articles on Go (board game) Game specifics Go rules Go handicaps Go proverbs Go terms Go strategy and tactics Fuseki (whole board openings) Joseki (corner based openings) Life and death Tsumego … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
James W. Cannon — (b. January 30, 1943) is an American mathematician working in the areas of low dimensional topology and geometric group theory. He is an Orson Pratt Professor of Mathematics at the Brigham Young University.Biographical dataJames W. Cannon was… … Wikipedia
